Downgrading the 1-median in the plane with Manhattan metric
نویسنده
چکیده
This paper deals with changing parameters of the 1-median problem in the plane with Manhattan metric within certain bounds such that the optimal objective value of the 1-median problem with respect to the new values of the parameters is maximized. An O(n log n) time algorithm is suggested that is mainly based on a fast search and prune procedure.
منابع مشابه
A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
This paper deals with downgrading the 1-median, i.e., changing values of parameters within certain bounds such that the optimal objective value of the location problem with respect to the new values is maximized. We suggest a game-theoretic view at this problem which leads to a characterization of an optimal solution. This approach is demonstrated by means of the Downgrading 1-median problem in...
متن کاملReducing medical downgrading in a high readiness Royal Marine unit.
OBJECTIVE This 3 year retrospective observational study aims to determine the diagnoses causing medical downgrading in a high readiness Royal Marine Commando unit, and to direct future investment to reduce numbers downgraded. METHODS Medical and administrative records were used to ascertain diagnoses, aetiology, time downgraded, and whether men returned to full duties. RESULTS 4.4% of unit ...
متن کاملUp- and downgrading the 1-median in a network⋆
While classical location problems deal with finding optimal locations for facilities, the task of the corresponding upgrading (downgrading) version is to change the underlying network within certain bounds such that the optimal objective value that can be obtained in the modified network is as good (bad) as possible. In this paper we allow to change the vertex weights within given bounds such t...
متن کاملApproximating Minimum Manhattan Networks
Given a set S of n points in the plane, we deene a Manhattan Network on S as a rectilinear network G with the property that for every pair of points in S, the network G contains the shortest rectilinear path between them. A Minimum Manhattan Network on S is a Manhattan network of minimum possible length. A Manhattan network can be thought of as a graph G = (V; E), where the vertex set V corresp...
متن کاملThe Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Given a set of nodes in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of nodes, the ratio of the network distance and the Euclidean distance of the two nodes is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-) m...
متن کامل